非线性玻尔兹曼方程的傅里叶谱方法

玻尔兹曼方程作为空气动理学中最基本的方程之一,是连接微观牛顿力学和宏观连续介质力学的重要桥梁.该方程描述了一个由大量粒子组成的复杂系统的非平衡态时间演化:除了基本的输运项,其最重要的特性是粒子间的相互碰撞由一个高维,非局部且非线性的积分算子来描述,从而给玻尔兹曼方程的数值求解带来非常大的挑战.在过去的二十年间,基于傅里叶级数的谱方法成为了数值求解玻尔兹曼方程的一种很受欢迎且有效的确定性算法.这主要归功于谱方法的高精度及它可以被快速傅里叶变换加速的特质.本文将回顾玻尔兹曼方程的傅里叶谱方法,具体包括方法的导出,稳定性和收敛性分析,快速算法,以及在一大类基于碰撞的空气动理学方程中的推广.     

Diffusion Model of a Non-Integer Order PIγ Controller with TCP/UDP Streams

In this article, a way to employ the diffusion approximation to model interplay between TCP and UDP flows is presented. In order to control traffic congestion, an environment of IP routers applying AQM (Active Queue Management) algorithms has been introduced. Furthermore, the impact of the fractional controller PIγ and its parameters on the transport protocols is investigated. The controller has been elaborated in accordance with the control theory. The TCP and UDP flows are transmitted simultaneously and are mutually independent. Only the TCP is controlled by the AQM algorithm. Our diffusion model allows a single TCP or UDP flow to start or end at any time, which distinguishes it from those previously described in the literature.     

Renormalization group second‐order approximation for singularly perturbed nonlinear ordinary differential equations

We consider a 2 time scale nonlinear system of ordinary differential equations. The small parameter of the system is the ratio ϵ of the time scales. We search for an approximation involving only the slow time unknowns and valid uniformly for all times at order O(ϵ²). A classical approach to study these problems is Tikhonov's singular perturbation theorem. We develop an approach leading to a higher order approximation using the renormalization group (RG) method. We apply it in 2 steps. In the first step, we show that the RG method allows for approximation of the fast time variables by their RG expansion taken at the slow time unknowns. Next, we study the slow time equations, where the fast time unknowns are replaced by their RG expansion. This allows to rigorously show the second order uniform error estimate. Our result is a higher order extension of Hoppensteadt's work on the Tikhonov singular perturbation theorem for infinite times. The proposed procedure is suitable for problems from applications, and it is computationally less demanding than the classical Vasil'eva‐O'Malley expansion. We apply the developed method to a mathematical model of stem cell dynamics.     

Multistrain edge‐based compartmental model on networks

Multistrain diseases, which are infected through individual contacts, pose severe public health threat nowadays. In this paper, we build competitive and mutative two‐strain edge‐based compartmental models using probability generation function (PGF) and pair approximation (PA). Both of them are ordinary differential equations. Their basic reproduction numbers and final size formulas are explicitly derived. We show that the formula gives a unique positive final epidemic size when the reproduction number is larger than unity. We further consider competitive and mutative multistrain diseases spreading models and compute their basic reproduction numbers. We perform numerical simulations that show some dynamical properties of the competitive and mutative two‐strain models.     

Linearly χ-bounding (P6, C4)-free graphs*

Given two graphs and , a graph is -free if it contains no induced subgraph isomorphic to or . Let and be the path on vertices and the cycle on vertices, respectively. In this paper we show that for any -free graph it holds that , where and are the chromatic number and clique number of , respectively. Our bound is attained by several graphs, for instance, the 5-cycle, the Petersen graph, the Petersen graph with an additional universal vertex, and all -critical -free graphs other than (see Hell and Huang [Discrete Appl. Math. 216 (2017), pp. 211–232]). The new result unifies previously known results on the existence of linear -binding functions for several graph classes. Our proof is based on a novel structure theorem on -free graphs that do not contain clique cutsets. Using this structure theorem we also design a polynomial time -approximation algorithm for coloring -free graphs. Our algorithm computes a coloring with colors for any -free graph in time.     

Insight into shear‐induced modification for improving processability of polymers: Effect of shear rate on the evolution of entanglement state

Many experimental results have revealed that the re‐entanglement kinetics of disentangled polymers is much slower than that predicted by tube theory. This retarded recovery of fully entangled state is of practical significance that shear‐induced modification may offer a way to improve processability for a polymer by reducing viscosity. This work tried to figure out the shear‐rate dependence variation of viscosity in the view of evolution of entanglement state through disentanglement and re‐entanglement, aiming to provide fundamental insights into application prospect of shear‐induced modification in preparing “in‐pellet” disentangled polymers prior to final processing. High‐density polyethylene was sheared on a parallel‐plate rotational rheometer with a linearly increased shear rate. Results showed that higher shear rate could induce further disentanglement, resulting in a lower viscosity with a reduction rate up to 93.7%, larger molecular weight between entanglements M_e , and longer re‐entanglement time. Additionally, less entanglement would give a larger lamellar thickness of sheared samples after nonisothermal crystallization. © 2019 Wiley Periodicals, Inc. J. Polym. Sci., Part B: Polym. Phys. 2019 , 57, 598–606     

Shedding vortex simulation method based on viscous compensation technology research

Owing to the influence of the viscosity of the flow field, the strength of the shedding vortex decreases gradually in the process of backward propagation. Large-scale vortexes constantly break up, forming smaller vortexes. In engineering, when numerical simulation of vortex evolution process is carried out, a large grid is needed to be arranged in the area of outflow field far from the boundary layer in order to ensure the calculation efficiency. As a result, small scale vortexes at the far end of the flow field cannot be captured by the sparse grid in this region, resulting in the dissipation or even disappearance of vortexes. In this paper, the effect of grid scale is quantified and compared with the viscous effect through theoretical derivation. The theoretical relationship between the mesh viscosity and the original viscosity of the flow field is established, and the viscosity term in the turbulence model is modified. This method proves to be able to effectively improve the intensity of small-scale shedding vortexes at the far end of the flow field under the condition of sparse grid. The error between the simulation results and the results obtained by using fine mesh is greatly reduced, the calculation time is shortened, and the high-precision and efficient simulation of the flow field is realized.